Travelling salesman problem - PDFSEARCH.IO - Document Search Engine

Travelling salesman problem
Results: 321

#	Item
21	J EPSILON Pi Mu Epsilon Journal Volume 2—Reprint Add to Reading List Source URL: www.pme-math.org Language: English - Date: 2013-10-17 15:52:26 Mathematics Graph theory Economy Operations research Matching Combinatorial optimization NP-complete problems Assignment problem Linear programming Transportation theory Inventory Travelling salesman problem
22	A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-04-27 05:26:50 Computational complexity theory Graph theory Mathematics NP-complete problems Steiner tree problem Approximation algorithm APX Spanning tree Optimization problem Wiener connector Travelling salesman problem
23	Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 · Add to Reading List Source URL: infolab.usc.edu Language: English - Date: 2016-05-21 03:16:43 Mathematics Graph theory Operations research Computational complexity theory Combinatorial optimization Mathematical optimization Travelling salesman problem Dynamic programming Algorithm Approximation algorithm Heterogeneous Earliest Finish Time Assignment problem
24	227 Documenta Math. Markowitz and Manne + Eastman + Land and Doig = Branch and Bound Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2012-07-25 10:25:04 Mathematics Operations research Mathematical optimization Combinatorial optimization Applied mathematics Travelling salesman problem Branch and bound Linear programming relaxation Integer programming Branch and cut Linear programming Algorithm
25	CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-01 15:15:38 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Operations research Combinatorial optimization NP-hard problems Online algorithm Steiner tree problem Minimum spanning tree Travelling salesman problem
26	CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-04 19:18:44 NP-complete problems Edsger W. Dijkstra Spanning tree Matroid theory Operations research Online algorithm Steiner tree problem Matroid Shortest path problem Algorithm Travelling salesman problem Greedy algorithm
27	Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGYDistributed System Engineering: SpringQuiz I Solutions Add to Reading List Source URL: nil.csail.mit.edu Language: English - Date: 2015-01-05 06:37:34 C POSIX library System calls File locking Write Readerswriter lock XC Travelling salesman problem Stat Open Inode
28	Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2016-07-01 10:19:11 NP-complete problems Clique problem Vertex cover Clique Independent set Bipartite graph Travelling salesman problem Graph coloring Line graph Treewidth Pathwidth
29	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
30	Computational Complexity of Ant Colony Optimization and Its Hybridization Frank Neumann1 , Dirk Sudholt2⋆ , and Carsten Witt3⋆ 1 Max-Planck-Institut f¨ Add to Reading List Source URL: ls2-www.cs.tu-dortmund.de Language: English - Date: 2009-04-06 09:15:22 Cybernetics Operations research Mathematical optimization Ant colony optimization algorithms Search algorithms Genetic algorithm Travelling salesman problem Evolutionary algorithm Algorithm Big O notation

UPDATE